A note on some characterizations of Sidon sets

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetic Characterizations of Sidon Sets

Let G be any discrete Abelian group. We give several arithmetic characterizations of Sidon sets in G. In particular, we show that a set A is a Sidon set iff there is a number 6 > 0 such that any finite subset A of A contains a subset B Q A with |B| > 6\A\ which is quasiindependent, i.e. such that the only relation of the form ]C\eB e x ^ = '̂ with e\ equal to + 1 or 0, is the trivial one. Let G ...

متن کامل

On Multiplicative Sidon Sets

Fix integers b > a ≥ 1 with g := gcd(a, b). A set S ⊆ N is {a, b}-multiplicative if ax 6= by for all x, y ∈ S. For all n, we determine an {a, b}-multiplicative set with maximum cardinality in [n], and conclude that the maximum density of an {a, b}-multiplicative set is b b+g . Erdős [2, 3, 4] defined a set S ⊆ N to be multiplicative Sidon1 if ab = cd implies {a, b} = {c, d} for all a, b, c, d ∈...

متن کامل

On Uniformly Approximable Sidon Sets

Let G be a compact abelian group and let T be the character group of G. Suppose £ is a subset of T. A trigonometric polynomial f on G is said to be an ^-polynomial if its Fourier transform / vanishes off E. The set E is said to be a Sidon set if there is a positive number B such that 2^xeb |/(X)| á-B||/||u for all E-polynomials /; here, ||/||„ = sup{ |/(x)| : xEG}. In this note we shall discuss...

متن کامل

Some Characterizations on Operations in Soft Sets

251 SOME CHARACTERIZATIONS ON OPERATIONS IN SOFT SETS V. Chinnadurai*, B. Anu** & A. Swaminathan*** * Associate Professor, Department of Mathematics, Annamalai University, Annamalai Nagar, Tamilnadu ** Research Scholar, Department of Mathematics, Annamalai University, Annamalai Nagar, Tamilnadu *** Associate Professor, Department of Mathematics, Aksheyaa College of Engineering, Tamilnadu Abstra...

متن کامل

A note on weak Sidon sequences

A sequence (ai) of integers is weak Sidon or well-spread if the sums ai + aj , for i < j , are all different. Let f (N) denote the maximum integer n for which there exists a weak Sidon sequence 0 a1< · · ·<an N . Using an idea of Lindström [An inequality for B2-sequences, J. Combin. Theory 6 (1969) 211–212], we offer an alternate proof that f (N)<N1/2 + O(N1/4), an inequality due to Ruzsa [Solv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1972

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1972-0303219-6